Optimization of a Reverse Logistics Network within the Ambit of Mobile Phones

نویسندگان

  • Isabel Fernández
  • David de la Fuente
  • Jesús Lozano Mosterín
  • Montse Suarez
چکیده

The present paper deals with the study of the design of a recycling chain for a certain type of WEEE, the mobile phones. The goal is to analyse the optimal design of the logistics network required to guarantee that the amount of wasted mobile phones obtained at the generation points is collected, managed and transported in an appropriate way to the destination points constituted by recycling companies. The problem falls into the category of the so named LRP (Location and Routing problems). The solution is achieved by adopting a sequential approach which implies to divide up the problem into two interrelated problems: one double location problem (of recycling centrals and transfer stations) and a routing problem which is solved by means of a modified version of Clarke and Wright (1964) method with limited capacity (CVRP) and with multiple depots (MDVRP).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Ant Colony approach to forward-reverse logistics network design under demand certainty

Forward-reverse logistics network has remained a subject of intensive research over the past few years. It is of significant importance to be issued in a supply chain because it affects responsiveness of supply chains. In real world, problems are needed to be formulated. These problems usually involve objectives such as cost, quality, and customers' responsiveness and so on. To this reason, we ...

متن کامل

A hybrid solution approach for a multi-objective closed-loop logistics network under uncertainty

The design of closed-loop logistics (forward and reverse logistics) has attracted growing attention with the stringent pressures of customer expectations, environmental concerns and economic factors. This paper considers a multi-product, multi-period and multi-objective closed-loop logistics network model with regard to facility expansion as a facility location–allocation problem, which more cl...

متن کامل

Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...

متن کامل

A reverse logistics chain mathematical model for a sustainable production system of perishable goods based on demand optimization

Sustainability in the supply chain means pushing the supply chain to focus on social, economic and environmental aspects, and addressing the existing problems in the traditional supply chain. Considering the importance of evaluating supply chain networks, especially in the field of perishable commodities, this paper aimed to design a mathematical model for the reverse supply chain of perishable...

متن کامل

Considering chain to chain competition in forward and reverse logistics of a dynamic and integrated supply chain network design problem

In this paper, a bi-objective model is presented for dynamic and integrated network design of a new entrant competitive closed-loop supply chain. To consider dynamism and integration in the network design problem, multiple long-term periods are regarded during planning horizon, so that each long-term period includes several short-term periods. Furthermore, a chain to chain competition between t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006